Competitive k-Server Algorithms
نویسندگان
چکیده
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server conjecture [MMS] up to the competitive ratio. The best previous result for general metric spaces was a 3-server randomized competitive algorithm [BKT] and a non-constructive proof that a deterministic 3-server competitive algorithm exists [BBKTW]. The competitive ratio we can prove is exponential in the number of servers. Thus, the question of the minimal competitive ratio for arbitrary metric spaces is still open.
منابع مشابه
Randomized algorithm for the k-server problem on decomposable spaces
We study the randomized k-server problem on metric spaces consisting of widely separated subspaces. We give a method which extends existing algorithms to larger spaces with the growth rate of the competitive quotients being at most O(log k). This method yields o(k)-competitive algorithms solving the randomized k-server problem, for some special underlying metric spaces, e.g. HSTs of"small"heigh...
متن کاملThe Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms
We consider the k-server problem [23] in a distributed setting. Given a network of n processors, and k identical mobile servers, requests for service appear at the processors and a server must reach the request-point. Besides modeling problems in computer networks where k identical mobile resources are shared by the processors of the network, this models a realistic situation where the transfer...
متن کاملFusible HSTs and the randomized k-server conjecture
We show that a potential-based algorithm for the fractional k-server problem on hierarchically separated trees (HSTs) with competitive ratio f (k) can be used to obtain a randomized algorithm for anymetric spacewith competitive ratio f (k)2O((log k)2). Employing theO((log k)2)competitive algorithm for HSTs from our joint work with Bubeck, Cohen, Lee, and Mądry (2017), this yields an O((log k)6)...
متن کاملCompetitive Algorithms for the Weighted Server Problem
Fiat, A. and M. Ricklin, Competitive algorithms for the weighted server problem, Theoretical Computer Science 130 (1994) 85-99. In this paper we deal with a generalization of the k-server problem (Manasse et al. 1988) in which the servers are unequal. In the weighted server mode1 each of the servers is assigned a positive weight. The cost associated with moving a server equals the product of th...
متن کاملCompetitive Algorithms for Generalized k-Server in Uniform Metrics
The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server si lies in its own metric space Mi. A request is a k-tuple r = (r1, r2, . . . , rk) and to serve it, we need to move some server si to the point ri ∈ Mi, and the goal is to minimize the total distance traveled by the servers. Despite much work, no f(k)-competitive al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 48 شماره
صفحات -
تاریخ انتشار 1994